The authors discussed the procedure of building a sequential coded quardtree , explain how to add points clouds to nodes of tree 闡述了順序四叉樹的快速建立,并通過一個試驗系統驗證了文中所提方法的有效性。
In order to fast culling invisible data and make result of progressive rendering reasonable , a sequential coded quardtree is built with points clouds evenly distributed to nodes of every layer from top to down 該方法通過構建一棵順序四叉樹使點云均勻分布在四叉樹節點上,來實現快速的數據篩選。